skeleton grow prune bend potenti ratio convex shape decomposit dstep code high definit video compress boost chamfer match learn chamfer distanc normal abstract propos techniqu significantli improv perform orient chamfer match imag clutter background match method measur templat fit edg map evalu score templat comparison auxiliari contour call normal util adaboost learn normal orient chamfer distanc nocd experiment result demonstr boost detect rate orient chamfer distanc simplic eas train nocd small number train sampl promis replac chamfer distanc orient chamfer distanc templat match applic weakli supervis shape base object detect particl filter abstract describ effici approach construct shape model compos contour part partial supervis learn propos approach easili transfer part structur object class long similar shape spatial layout part parametr densiti flexibl easier learn commonli gaussian parametr distribut express object detect state estim infer execut particl filter pf framework static observ previou pf method underli graph structur model fulli connect graph propos pf algorithm effici linear explor condit depend node repres contour part experiment result demonstr propos approach yield good detect result accur locat contour target object clutter imag contour base object detect part bundl learn context dsensit shape similar graph transduct skeleton particl filter abstract present method obtain high qualiti skeleton binari shape obtain skeleton connect pixel thick requir prune post process comput compos major part small set salient contour point comput discret curv evolut robust method particl filter obtain skeleton main idea particl walk skelet path pair salient point provid experiment result demonstr propos method significantli outperform method skeleton comput shape band deform object detect approach paper focu problem detect match queri object imag propos algorithm shape band model object bandwidth sketch contour featur point sketch gradient bandwidth detect stage algorithm simpli scan input imag locat scale good candid perform fine scale shape match locat precis object boundari take advantag inform shape band algorithm easi implement experiment result show outperform stat art contour base object detect algorithm local constrain diffus process local densifi distanc space applic shape retriev match retriev shape import challeng comput vision larg number shape similar approach develop main focu comparison match pair shape approach shape influenc similar measur pair shape propos approach shape influenc similar measur pair shape show influenc benefici unsupervis set prior knowledg shape class influenc shape propag diffus process graph form set shape classic diffus process perform shape space reason unstabl presenc nois underli local geometri spars introduc local constrain diffus process stabl nois present densifi shape space ad synthet point call ghost point present experiment result demonstr signific improv state art shape match algorithm mpeg data set obtain bull ey retriev score highest score report literatur improv svm classif imbalanc data set distanc space abstract imbalanc data set present challeng data mine commun rare event interest cost misclassifi rare event higher misclassifi usual event data highli skew usual difficult learn system accur detect rare event approach recent year handl imbalanc data set sampl major class ad synthet point minor class featur space distanc time seri euclidean nonmetr compar time seri requir warp time fact make imposs appli standard method smote insert synthet data point featur space present innov approach augment minor class ad synthet point distanc space wethenus support vector machin classif experiment result standard time seri show synthet point significantli improv classif rate rare event case improv accuraci svm keyword imbalanc data set support vector machin time seri outlier detect global optim exemplar dbase gmm outlier detect recent import problem data mine applic paper unsupervis algorithm outlier detect propos appli provabl global optim expect maxim em algorithm fit gaussian mixtur model gmm data set approach gaussian center data point estim mixtur proport interpret probabl cluster center data point outlier factor data point defin weight sum mixtur proport weight repres similar data point propos outlier factor base global properti data set contrast exist approach outlier detect strictli local experi perform simul real life data set demonstr superior perform propos approach demonstr abil detect unusu shape distanc learn base convex cluster abstract cluster activ research topic machin learn pattern recognit recent approach deliv impress result number challeng cluster task solv problem approach prior knowledg number cluster practic applic linear elong cluster cluster correctli paper gener framework propos solv problem convex cluster base learn distanc propos framework data transform elong structur compact distanc learn algorithm convex cluster algorithm cluster transform data present experiment result demonstr success solut problem propos approach suitabl superpixel gener common base recent high level imag segment algorithm outlier detect global optim exemplar dbase gmm outlier detect recent import problem data mine applic paper unsupervis algorithm outlier detect propos appli provabl global optim expect maxim em algorithm fit gaussian mixtur model gmm data set approach gaussian center data point estim mixtur proport interpret probabl cluster center data point outlier factor data point defin weight sum mixtur proport weight repres similar data point propos outlier factor base global properti data set contrast exist approach outlier detect strictli local experi perform simul real life data set demonstr superior perform propos approach demonstr abil detect unusu shape video code scheme base joint spatiotempor adapt predict abstract propos video code scheme depart tradit motion estim dct framework karhunen loev transform klt joint spatiotempor predict framework approach perform joint spatial tempor predict simultan introduc bypass complex inter frame techniqu computation intens advantag effect joint predict imag depend color space transform klt propos approach demonstr experiment consist lead improv video qualiti case compress rate improv comput speed contour group base contour dskeleton dualiti abstract paper present method group relev object contour edg map take advantag contour skeleton dualiti regular contour skeleton simultan combin low level perceptu constraint higher level model constraint effect model repres path symmetri set skeleton treat trajectori imaginari virtual robot discret space symmetr point obtain pair edg segment boundari defin map obtain group pair edg segment trajectori cast group problem manner make similar problem simultan local map slam adapt state theart probabilist framework rao blackwel particl filter successfulli appli slam framework maxim joint posterior skeleton contour improv shape retriev learn graph transduct abstract shape retriev match import topic comput vision recent progress domain driven design smart featur provid similar measur pair shape paper provid perspect problem exist shape group studi similar measur queri shape graph structur method gener built top exist shape match algorithm learn metric graph transduct propag model exist shape similar comput geodes shape manifold propos method requir learn shape manifold explicitli requir know class label exist shape present experiment result demonstr propos approach yield signific improv state art shape match algorithm obtain retriev rate mpeg data set highest report literatur merg map multipl robot merg local map acquir multipl robot global map map merg import issu face virtual cooper explor techniqu present simpl solut problem map merg reduc problem slam singl virtual robot individu local map shape inform constitut sensor inform virtual robot approach adapt framework rao blackwel particl filter slam singl robot problem map merg contour extract particl filter abstract paper describ approach extract object region imag track enclos contour assum imag complex roughli partit part intens threshold lot imag medic imag accord assumpt global constraint threshold local constraint gradient integr particl filter framework util filter track optim contour path pixel pixel process time depend contour length number particl propos method significantli faster popular time consum method activ contour model snake snake method target similar applic experiment result illustr valid advantag method symmetri shape dsimilar abstract describ simpl approach identifi main similar ax maxim similar object contour part divid ax symmetr approxim symmetr shape main similar axi coincid main axi symmetri concept main similar axi gener significantli easier comput identifi critic point contour similar comput express discret problem find subset critic point contour part determin subset maxim similar word shape comput divis part part maxim similar experiment result yield correctli maxim symmetri ax articul highli distort shape multiscal random field applic contour group introduc interpret multiscal random field msrf admit effici optim framework regular singl level random field rf base oper call append combin set random variabl rv singl rv assum msrf decompos disjoint tree link rv pyramid level append oper appli map rv tree structur singl rv demonstr us propos approach challeng task involv group contour target shape imag natur represent multiscal contour model need order cope unstabl contour decomposit append oper find optim imag segment label classic framework relax label altern method markov chain mont carlo mcmc comput stabl skeleton particl filter abstract present method obtain high qualiti skeleton binari shape obtain skeleton connect pixel thick requir prune post process comput compos major part small set salient contour point comput discret curv evolut robust method particl filter obtain skeleton main idea particl walk skelet path pair salient point provid experiment result demonstr propos method significantli outperform method skeleton comput gener dlocal summari local import task human autonom robot basi orient navig spatial environ perform map task robot local basi monomod perceptu inform investig intens present chapter local gener set refer inform provid type sensor descript locat varieti condit introduc condit discuss gener approach identifi locat perceiv environ take account cognit consider propos approach identifi locat high abstract level represent approach combin qualit quantit inform recogn locat configur shape featur evalu approach comparison approach selfloc task gener local task base schemat map path similar skeleton graph match paper propos graph match algorithm appli shape recognit base object silhouett main idea match skeleton graph compar geodes path skeleton endpoint contrast typic tree graph match method topolog graph structur approach motiv fact visual similar skeleton graph complet topolog structur propos comparison geodes path endpoint skeleton graph yield correct match result case skeleton prune contour partit discret curv evolut impli endpoint skeleton branch correspond visual part object experiment result demonstr method produc correct result presenc articul stretch contour deform skeleton dbase shape classif path similar unifi curvatur definit regular abstract paper propos definit curvatur call visual curvatur base statist extrem point height function comput direct gradual ignor small height multi scale curvatur obtain theoret properti experi present demonstr multi scale visual curvatur stabl presenc signific nois knowledg propos definit visual curvatur appli regular curv defin differenti geometri turn angl polygon curv yield stabl curvatur estim curv digit imag sever distort show relat multi scale visual curvatur convex simpl close curv topolog repair digit imag detect recognit contour part base shape similar due distort nois segment error overlap occlus object digit imag imposs extract complet object contour segment object case part contour correctli reconstruct perform edg group part boundari segment region recognit object base contour part promis research direct main contribut paper system detect recognit contour part digit imag detect recognit base shape similar contour part contour part produc contour group shape similar retriev similar contour part databas contour segment shape base classif retriev contour part perform simultan detect recognit import step approach construct databas contour segment complet contour object decompos part dce discret curv evolut represent construct invari scale rotat translat increment local outlier detect data stream abstract outlier detect recent import problem industri financi applic problem complic fact case outlier detect data stream arriv enorm pace paper increment lof local outlier factor algorithm detect outlier data stream propos propos increment lof algorithm equival detect perform iter static lof algorithm appli insert data record requir significantli comput time addit increment lof algorithm dynam updat profil data point import properti data profil chang time paper theoret evid insert data point delet data point influenc limit number closest neighbor number updat insert delet depend total number point data set experi perform simul real life data set demonstr propos increment lof algorithm computation effici time success detect outlier distribut behavior data stream applic visual curvatur lorenz manifold intrigu dimension surfac illustr chaotic dynam lorenz system find lorenz manifold explicit analyt solut develop method calcul numer approxim build surfac success geodes level set result mesh approxim read crochet instruct mean gener dimension model lorenz manifold mount crochet lorenz manifold stiff rod axi bendabl wire outer rim solut perpendicular axi crochet model inspir geometr properti lorenz manifold specif introduc simpl method determin visual local curvatur smooth surfac colour code curvatur reveal strike pattern region posit neg curvatur lorenz manifold discret skeleton evolut abstract skeleton view compact shape represent shape complet reconstruct form skeleton present method skeleton prune base fundament skeleton properti iter remov skeleton end brach smallest relev shape reconstruct relev branch measur contribut shape reconstruct propos prune method overcom instabl skeleton represent small boundari deform lead larg skeleton topolog obtain stabl skeleton represent planar shape shape classif base skeleton path similar contour group base local symmetri contour group base local symmetri optim subsequ biject problem elast match sequenc real number queri target sequenc noisi outlier element desir exclud outlier element match order obtain robust match perform applic shape align stereo correspond desir correspond biject remain element propos algorithm determin optim subsequ biject osb queri target sequenc osb effici comput map problem solut cheapest path dag direct acycl graph obtain excel result standard benchmark time seri dataset compar osb dynam time warp dtw warp window claim osb superior dtw result demonstr skip outlier element osb significantli improv match result real dataset osb suitabl partial match appli object recognit problem part contour obtain sequenc repres shape repres object contour sequenc curvatur skeleton ssm distanc transform paper propos approach skeleton base skeleton strength map ssm cacul euclidean distanc transform binari imag distanc transform gradient comput isotrop diffus perform gradient vector field skeleton strength map comput diffus vector field critic point set select local maxima ssm critic point locat signific visual part object skeleton obtain connect critic point geodes path approach overcom intrins drawback distanc transform base skeleton yield stabl connect skeleton lose signific visual part index term skeleton gradient vector field isotrop diffus distanc transform skeleton strength map ssm outlier detect kernel densiti function topolog equival object reconstruct digit imag digit easi digit object dens sampl grid reconstruct digit object topolog distort gener exist upper bound hausdorff distanc explain algorithm guarante topolog preserv show repair obtain digit imag local bound homeomorph close object result digit object wellcompos nice implic lot imag analysi problem show surfac origin object homeomorph result march cube algorithm surpris mean topolog problem march cube reconstruct simpli occur digit imag regular object base trilinear interpol construct smooth isosurfac digit imag topolog origin surfac final give surprisingli simpl topolog preserv reconstruct method overlap ball cubic voxel approach digit object guarante topolog preserv upper bound geometr distort output chosen pure voxel present union ball reconstruct trilinear interpol smooth isosurfac piecewis linear march cube surfac result directli applic huge class imag analysi algorithm show effici estim volum surfac area object digit measur volum surfac area digit object import problem imag analysi good estim multigrid converg error increas sampl densiti show present reconstruct method skeleton prune contour partit discret curv evolut abstract paper introduc skeleton prune method base contour partit contour partit partit obtain discret curv evolut dce yield excel result theoret properti experi present demonstr obtain skeleton accord human visual percept stabl presenc signific nois shape variat topolog origin skeleton proven propos approach produc spuriou branch common skeleton prune method propos prune method displac skeleton point skeleton point center maxim disk exist method displac skeleton point order produc prune skeleton index term skeleton skeleton prune contour partit discret curv evolut multi robot map forc field simul elast partial shape match techniqu properti perform shape similar measur abstract paper overview shape dissimilar measur properti metric robust properti retriev perform measur fifteen shape similar measur shortli compar retriev result mpeg core experi ce shape test set report literatur obtain reimplement compar discuss skeleton prune contour partit abstract paper introduc skeleton prune method base contour partit contour partit partit obtain discret curv evolut dce yield excel result theoret properti experi present demonstr obtain skeleton accord human visual percept stabl presenc signific nois shape variat topolog origin skeleton proven propos approach produc spuriou branch common skeleton prune method propos prune method displac skeleton point skeleton point center maxim disk exist method displac skeleton point order produc prune skeleton index term skeleton skeleton prune contour partit discret curv evolut object track dynam templat updat occlus detec object digit major interpol march cube previou paper show object digit chang topolog object regular reconstruct method fulfil requir paper give import exampl reconstruct method introduc major interpol algorithm interpol sampl point doubl resolut topolog ambigu resolv show march cube algorithm modifi topolog preserv approach digit object guarante topolog preserv voxel base polygon surfac base reconstruct object digit major interpol march cube previou paper show object digit chang topolog object regular reconstruct method fulfil requir paper give import exampl reconstruct method introduc major interpol algorithm interpol sampl point doubl resolut topolog ambigu resolv show march cube algorithm modifi topolog preserv approach digit object guarante topolog preserv voxel base polygon surfac base reconstruct extend em segment planar structur object digit topolog preserv reconstruct paper deriv sampl theorem guarante topolog preserv digit object theorem applic reconstruct method unionof ball reconstruct trilinear interpol extend em planar approxim data polygon approxim laser rang data base perceptu group em abstract goal polygon approxim laser rang data point obtain mobil robot propos approach precis estim number model compon line segment initi paramet independ initi valu principl perceptu group evalu approxim qualiti obtain expect maxim em step evalu em approxim qualiti recogn local optim solut modifi number model compon paramet em converg global optim solut independ initi number model compon initi paramet polygon approxim point set abstract paper address problem piecewis linear approxim point set constraint order data point number model compon line segment point problem maximum likelihood estim mle present drawback practic applic parametr model obtain classic mle framework guarante close data point typic imposs classic framework detect parametr model fit data problem relat accur choos optim number model compon fit nonparametr densiti data point defin neighborhood data observ insid neighborhood deem inform neighborhood deem uninform purpos mean recogn model fail properli fit data obtain maximum likelihood estim optim kullback leibler diverg kld nonparametr data densiti restrict neighborhood mixtur parametr model prove assumpt larg sampl size infer model compon close ground truth model compon counterpart hold independ initi number assum model compon paramet propos approach estim number signific model compon addit comput spatiotempor block reduc uncertainti detect track move object video em deriv kullback dleibler diverg spatiotempor block reduc uncertainti detect track move object video track motion object infrar video geometr robot map partial elast match time seri problem elast match time seri propos algorithm determin subsequ target time seri match queri seri propos algorithm map problem match subsequ problem cheapest path dag direct acycl graph propos approach comput optim scale translat time seri valu nontrivi problem case subsequ match activ motion detect base measur textur chang elast partial match time seri abstract problem elast match time seri propos algorithm automat determin subsequ target time seri match queri seri propos algorithm map problem match subsequ problem cheapest path dag direct acycl graph experiment result demonstr propos algorithm outperform commonli dynam time warp retriev accuraci instantan reliabl assess motion featur surveil video optim partial shape similar human recogn object presenc signific amount occlus view angl human robot vision condit normal situat except digit imag problem occur due unstabl outcom segment algorithm normal case shape partial visibl visibl part distort knowledg exist shape represent similar approach work condit approach solv object recognit problem main contribut paper definit optim partial shape similar measur work condit present approach shape base object recognit work shape match robot map abstract present geometr model robot map base shape shape similar measur match techniqu origin comput vision special redesign match rang scan fundament geometr represent structur polygon line order cyclic order visibl approach improv underli geometr model todai slam implement shape match disregard pose estim object center approach compact represent suit bridg gap metric inform need path plan abstract topolog qualit spatial knowledg desir complex navig task dstream approach adapt rate control multimedia applic shape dbase robot map abstract present geometr model robot map suit robot equip laser rang finder geometr represent base shape cyclic order set polygon line underli data structur special adapt shape match techniqu origin comput vision appli match rang scan partial construct map shape match respect wider context convent scan match approach allow disregard pose estim shape base approach improv underli geometr model todai slam implement object center approach compact represent suit bridg gap metric inform need robot motion path plan abstract topolog qualit spatial knowledg desir complex navig task commun shape match robot map abstract present geometr model robot map base shape shape similar measur match techniqu origin comput vision special redesign match rang scan fundament geometr represent structur polygon line order cyclic order visibl approach improv underli geometr model todai slam implement shape match disregard pose estim object center approach compact represent suit bridg gap metric inform need path plan abstract topolog qualit spatial knowledg desir complex navig task detect surveil video paper provid theoret experiment result dimens video trajectori tool access mid level content video appear disappear object veloc direct move object amount proport size object involv speed achiev robust techniqu dimension comput video trajectori base eigenvalu shape similar visual part human percept shape base visual part object point singl signific visual part su cient recogn object hand door expect human door cognit motiv shape similar measur recognit applic base visual part cognit assumpt lead relat problem scale select subpart select find queri part part object correct size scale select assum correct size select part compar subpart subpart select tree dstructur partit base split histogram distanc topolog digit space show topolog topolog connect set connect intuit sens topolog present marcu wyse al amer math monthli pp khalimski al topolog applic pp found applic comput graphic comput vision rosenfeld amer math monthli pp kong al amer math monthli pp topolog product topolog remain topolog gener topolog product topolog kei word digit topolog alexandro topolog digit plane digit space choic vantag object imag retriev suppos matrix dissimilar imag databas imag select similar imag databas expens comput dissimilar object imag databas find lt lt vantag object vleugel veltkamp databas order select match imag euclidean distanc vector dissimilar imag vantag object vector imag databas paper treat choic suitabl vantag object suggest loss measur assess qualiti set vantag object imag select match imag remain imag databas vantag set averag result dissimilar compar class choic strategi base stepwis forward select vantag object optim loss measur choos object repres rang databas automat recognit unpredict event video present approach recogn frame video sequenc significantli previou frame detect unpredict event video map video sequenc polygon trajectori map frame featur vector join vector repres consecut frame line segment shape analysi obtain polygon curv detect frame repres unpredict event demonstr perform approach surveil video recov polygon noisi data special issu shape represent similar imag databas applic planar shape comparison object retriev imag databas similar measur silhouett object present properti analyz respect retriev similar object imag databas reduc influenc digit nois segment error shape simplifi process digit curv evolut comput similar measur establish correspond visual part explicitli comput visual part similar part comput sum experiment result show shape match procedur intuit shape correspond stabl respect nois distort shape descriptor drigid shape singl close contour core experi ce shape shape descriptor perform mpeg standard gave uniqu opportun compar shape descriptor rigid shape singl close contour main differ respect comparison result report literatur shape descriptor experi carri institut favor descriptor impli paramet system optim determin implement throughli test compar perform shape descriptor base total mathemat approach theoret comparison descriptor extrem hard paper report mpeg core experi ce shape automat extract relev frame video polygon simplif schemat map simplif geograph shape discret curv evolut shape simplif map represent reason abstract irrelev detail reduc map user cognit load simplifi inform map smaller scale deriv detail refer map present method abstract simplifi cartograph represent accur spatial data emploi method discret curv evolut develop simplifi perceptu shape characterist explain specif problem appli method cartograph data elabor algorithm present hand simplifi spatial data degre abstract intend user hand violat local spatial order element cartograph entiti local arrang entiti assum import spatial knowledg characterist oper implement method demonstr exampl cartograph data relev rank video data hidden markov model distanc polygon simplif video map multidimension signal euclidean space translat predict passag video linear section signal linear section filter techniqu similar simplifi planar curv degre simplif select refin techniqu make probabilist distanc statist imag model video frame model obtain appli hidden markov model techniqu random walk imag techniqu viewer brows video level summar suit patienc level applic includ creation smart fast forward function digit vcr automat creation short summari preview video download web keyword brows skim summar video segment hmm random walk markov model continu discret curv evolut polygon evolut vertex delet abstract propos simpl approach evolut polygon curv special design discret natur curv digit imag lead simpli cation shape complex withnoblur shape round ect disloc relev featur approach problem determin size discret step numer implement occur evolut method lead natur nite number discret evolut step iter basic procedur vertex delet shape descript search similar object imag databas contour dbase shape similar abstract paper overview shape dissimilar measur properti metric robust properti retriev perform measur fifteen shape similar measur shortli compar retriev result mpeg core experi ce shape test set report literatur obtain reimplement compar discuss convex rule shape decomposit base discret contour evolut concentr decomposit object meaning part visual form orvisu part simpl observ convex part object determin visual part problem signific visual part convex visual part concav solv problem identifi convex part stage propos contour evolut method signific visual part convex object part higher stage evolut obtain rule decomposit object visual part call hierarch convex rule state visual part enclos maxim convex respect object boundari arc stage contour evolut rule determin part boundari curv directli visual part object stage evolut hierarchi induc hierarch structur visual part advanc stage contour evolut signific shape contribut obtain visual part academ press kei word visual part discret curv evolut digit curv digit straight line segment total curvatur shape hierarchi digit geometri digit preserv shape present method simul japanes lacquer ware promin east asian handicraft art popular kind japanes lacquer ware made maki nashiji techniqu digit geometr method document imag analysi digit geometr method imag analysi compress abstract import problem relat imag analysi compress find repeat structur focu paper develop digit geometr model method find regular structur digit document imag applic digit geometr approach demonstr imag orthograph perspect project fast linear time algorithm comput static threshold minim welt composed weak connect document imag digit similar measur introduc outperform standard similar measur includ hansdorff distanc respect determin discret object imag digit prototyp measur model base compress algorithm variat algorithm develop find structur imag affin perspect transform shape decomposit shape similar measur discret approach curv evolut preserv topolog digit process supported tame differentialless geometri plane curv introduc class planar arc curv call tame arc gener describ part boundari planar real object tame arc smooth part sharp differenti corner polygon arc tame hand class arc restrict rule patholog arc infinit inflect turn infinit tame arc finit inflect total absolut turn finit dcompos pictur segment imag digit imag point assign uniqu label object belong foreground object segment imag object properti analyz background object digit imag adjac relat foreground segment imag adjac di erent background adjac interchang foreground background chang connect compon digit pictur choic foreground background critic result subsequ analysi object group case clear begin analysi constitut foreground background choic immedi determin connect compon digit pictur special realist digit model straight line understand digit line compris compon determin digit set digit line segment exist real straight line ir digit ii recov space straight line digit digit line segment problem extens studi research comput vision digit geometri primari digit model object boundari quantiz realist sensor model comput vision paper present realist mathemat model digit edg handl blur arbitrari threshold show threshold digit imag blur half plane obtain unknown threshold equal imag perfectli focus half plane slope obtain object boundari quantiz result impli recov slope blur half plane imag obtain algorithm simplic test condit guarante digit process preserv topolog dcompos set special class subset binari digit imag call amp quot compos set amp quot defin set class nice topolog properti jordan curv theorem hold euler characterist local comput connected relat connected equival impli basic algorithm comput vision simpler real advantag appli thin algorithm compos set thin intern oper set problem irreduc amp quot thick amp quot set disappear prove skeleton obtain amp quot point thick amp quot give formal definit concept show skeleton graph structur defin mean digit preserv topolog differenti geometr properti paper present condit guarante digit process preserv import topolog differenti geometr properti condit determin correct digit resolut class real object know properti invari digit featur base recognit condit impli digit pattern occur neighborhood boundari point digit nois detect neighborhood boundari point match pattern due nois definit digit approxim real digit process digit process model map continu set repres real object discret set repres digit imag show object digit homotopi equival impli gener convex cp boundari convex set definit gener wai class gener make tupl pair point valentin properti tripl point line segment pq qr rp contain shown set properti union convex set paper studi properti close relat weaker properti cp amp quot collinear amp quot hold collinear tripl point prove close curv boundari convex set simpl arc part boundari convex set iff properti cp result appear simpl character boundari convex set solv problem studi year ago menger valentin convex convex arc convex curv gener convex boundari set convex pair point qe line segment pq contain definit gener wai call starshapedfrom po poq contain semi dproxim continu function digit imag start intuit concept near binar relat semi proxim space sp space defin restrict semi proxim space weaker topolog proxim space semi proxim space gener classic topolog space describ digit pictur comput vision comput graphic trivial semi proxim space classic topolog semi proxim space establish formal relationship topolog concept digit imag process continu counterpart interest continu function semi proxim space call semi proxim continu function character behav oper digit imag thin shown delet simpl point treat semi proxim continu function properti fact varieti near relat defin digit pictur semi proxim continu function tool difficult task shape descript multicolor dcompos pictur dparametr digit shape represent recoveri invari thin distanc transform orient qualit angl spatial reason umlich schlie dfen und berechenbarkeit digital und allgemein topologi der bildhaften wissensrepr sentat connect relat quantifi scope formal present paper make realis idea assign scope ambigu represent sentenc ambigu regard quantifi scope scope determin result extend represent addit context world knowledg condit scope determin inform formal work scope ambigu represent scope inform complet determin natur languag sentenc hybrid reason process spatial express index techniqu implement command relat topologi depiktionen 